A loop-free shortest-path routing algorithm for dynamic networks
نویسندگان
چکیده
منابع مشابه
Engineering a New Loop-Free Shortest Paths Routing Algorithm
We present LFR (Loop Free Routing), a new loop-free distance vector routing algorithm, which is able to update the shortest paths of a distributed network with n nodes in fully dynamic scenarios. If Φ is the total number of nodes affected by a set of updates to the network, and φ is the maximum number of destinations for which a node is affected, then LFR requires O(Φ ·∆) messages and O(n+φ ·∆)...
متن کاملDynamic shortest path in stochastic dynamic networks: Ship routing problem
In this paper, we apply the stochastic dynamic programming to find the dynamic shortest path from the source node to the sink node in stochastic dynamic networks, in which the arc lengths are independent random variables with exponential distributions. In each node there is an environmental variable, which evolves in accordance with a continuous time Markov process. The parameter of the exponen...
متن کاملFault Free Shortest Path Routing on the de Bruijn Networks
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classified dBG based routing algorithms into shortest path routing and fault tolerant routing but investigation into shortest path in failure mode in dBG has been nonexistent. In addition, as the size of the network increase,...
متن کاملEndhost-Based Shortest Path Routing in Dynamic Networks: Supporting Materials
Proof. The proof is based on a similar idea as in the proof of Theorem 3.1 in [2]: if we modify the link weights so that a competitive link becomes part of the optimal path and thus must be used most of the time by any good algorithm, then this link must be used sufficiently often (Ω(log T ) in T steps) by the same algorithm under the original link weights because we do not know which weight co...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.11.001